Dual linear programming bounds for sphere packing via modular forms
نویسندگان
چکیده
We obtain new restrictions on the linear programming bound for sphere packing, by optimizing over spaces of modular forms to produce feasible points in dual program. In contrast situation dimensions 8 8 and alttext="24"> 24 encoding="application/x-tex">24 , where is sharp, we show that it comes nowhere near best packing densities known alttext="12"> 12 encoding="application/x-tex">12 alttext="16"> 16 encoding="application/x-tex">16 alttext="20"> 20 encoding="application/x-tex">20 alttext="28"> 28 encoding="application/x-tex">28 alttext="32"> 32 encoding="application/x-tex">32 . More generally, provide a systematic technique proving separations this sort.
منابع مشابه
Convergent Lower Bounds for Packing Problems via Restricted Dual Polytopes
Cutting-stock and bin-packing problems have been widely studied in the operations research literature for their large range of industrial applications. Many integer programming models have been proposed for them. The most famous is from Gilmore and Gomory [5] and relies on a column generation scheme. Column generation methods are known to have convergence issues, and (when minimizing) no useful...
متن کاملQuantum Sphere-Packing Bounds with Polynomial Prefactors
We study lower bounds on the optimal error probability in classical coding over classicalquantum channels at rates below the capacity, commonly termed quantum sphere-packing bounds. Winter and Dalai have derived such bounds for classical-quantum channels; however, the exponents in their bounds only coincide when the channel is classical. In this paper, we show that these two exponents admit a v...
متن کاملInferring Channel Buffer Bounds Via Linear Programming
We present a static analysis for inferring the maximum amount of buffer space used by a program consisting of concurrently running processes communicating via buffered channels. We reduce the problem to linear programming by casting the analysis as a fractional capability calculus system. Our analysis can reason about buffers used by multiple processes concurrently, and runs in time polynomial ...
متن کاملLinear programming bounds for doubly-even self-dual codes
We give a new proof of the Mallows-Sloane bound on the minimum distance of doubly-even self-dual codes. The proof avoids using the Gleason theorem and invariant theory. It is based on a special choice of the polynomial in the conventional linear programming approach.
متن کاملLinear Programming Bounds for Codes via a Covering Argument
We recover the first linear programming bound of McEliece, Rodemich, Rumsey, and Welch for binary error-correcting codes and designs via a covering argument. It is possible to show, interpreting the following notions appropriately, that if a code has a large distance, then its dual has a small covering radius and, therefore, is large. This implies the original code to be small. We also point ou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2021
ISSN: ['1088-6842', '0025-5718']
DOI: https://doi.org/10.1090/mcom/3662